package com.company.arithmetic;

import javax.swing.text.Style;
import java.util.*;

/**
 * Created by v on 16-12-19.
 */
public class Main {
    static int n=0;
    static int m=0;
    static int[] map;
    static HashSet<Integer> set;
    static int max;
    static boolean z=false;

    public static void main(String[] args) {
        Scanner input=new Scanner(System.in);
        n=input.nextInt();

        for(int i=0;i<n;i++){
            m=input.nextInt();
            z=false;
            map=new int[m];
            set=new HashSet<>();
            for(int j=0;j<m;j++){
                map[j]=input.nextInt();
            }
            Arrays.sort(map);

            for(int j=0;j<m;j++){
                set.add(map[j]);
            }
            max=map[m-1];

            for(int j=2;j<m;j++){
                DFS(0,j,"",0);
            }
            if(!z){
                System.out.println("Can't find any equations.");
            }
            System.out.println();
        }
    }

    public static void DFS(int index,int depth,String result,int sum){
        if(depth==0) {
            if (set.contains(sum)) {
                System.out.println(result.substring(1) + "=" + sum);
                z=true;
            }
            return;
        }
        if(sum>=max){
            return;
        }

        for(int i=index;i<m;i++){
            DFS(i+1,depth-1,
                    result+"+"+map[i],sum+map[i]);
        }
    }
}
